Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n)
نویسندگان
چکیده
We show that Maximum Independent Set on connected graphs of average degree at most three can be solved in O(1.08537) time and linear space. This improves previous results on graphs of maximum degree three, as our connectivity requirement only functions to ensure that each connected component has average degree at most three. We link this result to exact algorithms of Maximum Independent Set on general graphs. Also, we obtain a faster parametrised algorithm for Vertex Cover restricted to graphs of maximum degree three running in time O(1.1781).
منابع مشابه
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree
max independent set is a paradigmatic problem in theoretical computer science and numerous studies tackle its resolution by exact algorithms with non-trivial worst-case complexity. The best such complexity is, to our knowledge, the O(1.1889) algorithm claimed by (J. M. Robson, Finding a maximum independent set in time O(2), Technical Report 1251-01, LaBRI, Université de Bordeaux I, 2001) in his...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملSmaller Parameters for Vertex Cover Kernelization
We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Str{\o}mme [WG 2016] who gave a kernel with $\mathcal{O}(|X|^{12})$ vertices when $X$ is a vertex set such that each connected component of $G-X$ contains at most one cycle, i.e., $X$ is a modulator to a pseudoforest. We strongly generalize this re...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملOn Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n2 log6 n) time for n-vertex graphs with maximum degree at most three. key words: 3-regular graph, bipartite permutat...
متن کامل